Real-world extensions to scheduling algorithms based on lagrangian relaxation
نویسندگان
چکیده
منابع مشابه
Real-World Extensions to a Production Scheduling Algorithm Based on Lagrangian Relaxation
In this article, we develop three e f lc ient extensions t o a recent production scheduling algorithm based on Lagrangian relaxation [9]. These extensions handle the following real-world features: 0 stochastic availability of raw material, 0 reworking and scrapping of parts , and 0 incorporating set-up costs and set-up t imes in the Scheduling of multiclass manufacturing sys tems The f irs t t ...
متن کاملBounds Based on the Augmented Lagrangian and Lagrangian Relaxation Algorithms ∗
For a given iterate generated by the augmented Lagrangian or the Lagrangian relaxation based method, we derive estimates for the distance to the primal solution of the underlying optimization problem. The estimates are obtained using some recent contributions to the sensitivity theory, under appropriate first or second order sufficient optimality conditions. The given estimates hold in situatio...
متن کاملCustom Scheduling Algorithms in Real-world Applications
The paper describes the possibility of using of the Preactor Express software as a visualisation and manipulation platform for custom scheduling algorithms. The implementation of a custom scheduling algorithm for a real-world application is often far less time consuming than developing a practical and comfortable user interface for the application. It is the reason why many of scheduling algori...
متن کاملLagrangian Duality based Algorithms in Online Scheduling
We consider Lagrangian duality based approaches to design and analyze algorithms for online energy-efficient scheduling. First, we present a primal-dual framework. Our approach makes use of the Lagrangian weak duality and convexity to derive dual programs for problems which could be formulated as convex assignment problems. The duals have intuitive structures as the ones in linear programming. ...
متن کاملApplying Lagrangian relaxation-based algorithms for airline coordinated flight scheduling problems
The solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed to solve the coordinated fleet routing and flight scheduling problems. Numerical tests are performed to evaluate the proposed algorithm using real operating data from two Taiwan airlines. The test results indicate that the solution algorithm is a sig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sadhana
سال: 1996
ISSN: 0256-2499,0973-7677
DOI: 10.1007/bf02745567